Termination w.r.t. Q proof of TRS/TRCSREx14_AEGL02

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE(from(X)) → FROM(s(X))
PROPER(from(X)) → FROM(proper(X))
TOP(mark(X)) → PROPER(X)
LENGTH(ok(X)) → LENGTH(X)
PROPER(length(X)) → PROPER(X)
LENGTH1(ok(X)) → LENGTH1(X)
ACTIVE(from(X)) → FROM(active(X))
ACTIVE(length(cons(X, Y))) → S(length1(Y))
PROPER(length1(X)) → PROPER(X)
S(mark(X)) → S(X)
PROPER(length1(X)) → LENGTH1(proper(X))
TOP(mark(X)) → TOP(proper(X))
PROPER(s(X)) → S(proper(X))
S(ok(X)) → S(X)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(from(X)) → CONS(X, from(s(X)))
CONS(mark(X1), X2) → CONS(X1, X2)
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(length1(X)) → LENGTH(X)
FROM(mark(X)) → FROM(X)
PROPER(cons(X1, X2)) → PROPER(X1)
ACTIVE(length(cons(X, Y))) → LENGTH1(Y)
PROPER(length(X)) → LENGTH(proper(X))
TOP(ok(X)) → ACTIVE(X)
ACTIVE(from(X)) → S(X)
ACTIVE(s(X)) → S(active(X))
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(s(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
PROPER(from(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
ACTIVE(from(X)) → ACTIVE(X)
FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(from(X)) → FROM(s(X))
PROPER(from(X)) → FROM(proper(X))
TOP(mark(X)) → PROPER(X)
LENGTH(ok(X)) → LENGTH(X)
PROPER(length(X)) → PROPER(X)
LENGTH1(ok(X)) → LENGTH1(X)
ACTIVE(from(X)) → FROM(active(X))
ACTIVE(length(cons(X, Y))) → S(length1(Y))
PROPER(length1(X)) → PROPER(X)
S(mark(X)) → S(X)
PROPER(length1(X)) → LENGTH1(proper(X))
TOP(mark(X)) → TOP(proper(X))
PROPER(s(X)) → S(proper(X))
S(ok(X)) → S(X)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(from(X)) → CONS(X, from(s(X)))
CONS(mark(X1), X2) → CONS(X1, X2)
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(length1(X)) → LENGTH(X)
FROM(mark(X)) → FROM(X)
PROPER(cons(X1, X2)) → PROPER(X1)
ACTIVE(length(cons(X, Y))) → LENGTH1(Y)
PROPER(length(X)) → LENGTH(proper(X))
TOP(ok(X)) → ACTIVE(X)
ACTIVE(from(X)) → S(X)
ACTIVE(s(X)) → S(active(X))
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(s(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
PROPER(from(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
ACTIVE(from(X)) → ACTIVE(X)
FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

PROPER(from(X)) → FROM(proper(X))
ACTIVE(from(X)) → FROM(s(X))
TOP(mark(X)) → PROPER(X)
LENGTH(ok(X)) → LENGTH(X)
PROPER(length(X)) → PROPER(X)
LENGTH1(ok(X)) → LENGTH1(X)
ACTIVE(from(X)) → FROM(active(X))
ACTIVE(length(cons(X, Y))) → S(length1(Y))
S(mark(X)) → S(X)
PROPER(length1(X)) → PROPER(X)
PROPER(length1(X)) → LENGTH1(proper(X))
PROPER(s(X)) → S(proper(X))
TOP(mark(X)) → TOP(proper(X))
ACTIVE(s(X)) → ACTIVE(X)
S(ok(X)) → S(X)
CONS(mark(X1), X2) → CONS(X1, X2)
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
ACTIVE(length1(X)) → LENGTH(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
FROM(mark(X)) → FROM(X)
PROPER(cons(X1, X2)) → PROPER(X1)
ACTIVE(length(cons(X, Y))) → LENGTH1(Y)
PROPER(length(X)) → LENGTH(proper(X))
TOP(ok(X)) → ACTIVE(X)
ACTIVE(from(X)) → S(X)
ACTIVE(s(X)) → S(active(X))
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
PROPER(cons(X1, X2)) → PROPER(X2)
ACTIVE(from(X)) → ACTIVE(X)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 8 SCCs with 16 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH1(ok(X)) → LENGTH1(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

LENGTH1(ok(X)) → LENGTH1(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
LENGTH1(x1) = LENGTH1(x1)
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

ok₁ > LENGTH1₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(ok(X)) → LENGTH(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

LENGTH(ok(X)) → LENGTH(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
LENGTH(x1) = LENGTH(x1)
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

ok₁ > LENGTH₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(ok(X)) → S(X)
S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S(ok(X)) → S(X)

The remaining pairs can at least be oriented weakly.

S(mark(X)) → S(X)

Used ordering: Combined order from the following AFS and order.
S(x1) = S(x1)
ok(x1) = ok(x1)
mark(x1) = x1

Lexicographic Path Order [19].
Precedence:

ok₁ > S₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

S(mark(X)) → S(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
S(x1) = S(x1)
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

mark₁ > S₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS(mark(X1), X2) → CONS(X1, X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS(ok(X1), ok(X2)) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.

CONS(mark(X1), X2) → CONS(X1, X2)

Used ordering: Combined order from the following AFS and order.
CONS(x1, x2) = CONS(x2)
mark(x1) = mark
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

mark > CONS₁
ok₁ > CONS₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS(mark(X1), X2) → CONS(X1, X2)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

CONS(mark(X1), X2) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2) = CONS(x1)
mark(x1) = mark(x1)

Lexicographic Path Order [19].
Precedence:

mark₁ > CONS₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM(mark(X)) → FROM(X)
FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FROM(mark(X)) → FROM(X)

The remaining pairs can at least be oriented weakly.

FROM(ok(X)) → FROM(X)

Used ordering: Combined order from the following AFS and order.
FROM(x1) = FROM(x1)
mark(x1) = mark(x1)
ok(x1) = x1

Lexicographic Path Order [19].
Precedence:

mark₁ > FROM₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

FROM(ok(X)) → FROM(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
FROM(x1) = FROM(x1)
ok(x1) = ok(x1)

Lexicographic Path Order [19].
Precedence:

ok₁ > FROM₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(length(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(length1(X)) → PROPER(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(length1(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(length(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = PROPER(x1)
length(x1) = x1
s(x1) = x1
from(x1) = x1
cons(x1, x2) = cons(x1, x2)
length1(x1) = length1(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(from(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(s(X)) → PROPER(X)
PROPER(length(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = PROPER(x1)
s(x1) = x1
length(x1) = x1
from(x1) = from(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(length(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(length(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.

PROPER(s(X)) → PROPER(X)

Used ordering: Combined order from the following AFS and order.
PROPER(x1) = PROPER(x1)
length(x1) = length(x1)
s(x1) = x1

Lexicographic Path Order [19].
Precedence:

length₁ > PROPER₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(s(X)) → PROPER(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

PROPER(s(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
PROPER(x1) = PROPER(x1)
s(x1) = s(x1)

Lexicographic Path Order [19].
Precedence:

s₁ > PROPER₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ PisEmptyProof

              ↳ QDP

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → ACTIVE(X)
ACTIVE(s(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(s(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.

ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = ACTIVE(x1)
cons(x1, x2) = x1
from(x1) = x1
s(x1) = s(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(cons(X1, X2)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.

ACTIVE(from(X)) → ACTIVE(X)

Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = ACTIVE(x1)
cons(x1, x2) = cons(x1, x2)
from(x1) = x1

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(from(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

ACTIVE(from(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = ACTIVE(x1)
from(x1) = from(x1)

Lexicographic Path Order [19].
Precedence:

from₁ > ACTIVE₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ PisEmptyProof

              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ EdgeDeletionProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(X))

The TRS R consists of the following rules:

active(from(X)) → mark(cons(X, from(s(X))))
active(length(nil)) → mark(0)
active(length(cons(X, Y))) → mark(s(length1(Y)))
active(length1(X)) → mark(length(X))
active(from(X)) → from(active(X))
active(cons(X1, X2)) → cons(active(X1), X2)
active(s(X)) → s(active(X))
from(mark(X)) → mark(from(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
s(mark(X)) → mark(s(X))
proper(from(X)) → from(proper(X))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
proper(0) → ok(0)
proper(length1(X)) → length1(proper(X))
from(ok(X)) → ok(from(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
length1(ok(X)) → ok(length1(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.